Performing High-Level Synthesis via Program Transformations within a Theorem Prover
نویسندگان
چکیده
In this paper, we present a new methodology towards performing high-level synthesis. During high-level synthesis an algorithmic description is mapped to a structure of hardware components. In our approach, high-level synthesis is performed via program transformations. All transformations are performed within a higher order logic theorem prover thus guaranteeing correctness. Our approach is not restricted to data flow graphs but supports arbitrary computable functions, i.e. mixed control/data flow graphs. Furthermore, the treatment of algorithmic and interface descriptions is orthogonalised, allowing systematic reuse of
منابع مشابه
Formal Synthesis at the Algorithmic Level
In our terminology, the term \formal synthesis" stands for a synthesis process where the implementation is derived from the speciica-tion by applying elementary mathematical rules within a theorem prover. As a result the implementation is guaranteed to be correct. In this paper we introduce a new methodology to formally derive register-transfer structures from descriptions at the algorithmic le...
متن کاملNumeric Types in Formal Synthesis
The Formal Synthesis methodology can be considered as the application of the transformational approach to circuit synthesis by logical transformations performed in a theorem prover. Additionally to the implementation of the circuit, the proof that the result is a correct implementation of a given specification is obtained automatically. In this paper, a higher-order formalisation for the arithm...
متن کاملDeriving Structural RT-Implementations from Algorithmic Descriptions by means of Logical Transformations
This paper presents a formal synthesis approach where the mapping of an al-gorithmic description towards its structural implementation at the RT-level is performed by means of basic logical transformations in a higher order logic theorem prover. The approach goes beyond pure basic blocks and allows representing and synthesizing arbitrary computable programs. A functional style is used for repre...
متن کاملUse of a Theorem Prover for Transformational Synthesis
Transformational synthesis is the process of generating a hardware implementation from an initial behavioural description, by repeatedly applying transformations to the behavioural descriptions until a satisfactory implementation can be generated. It is essential to verify the correctness of the applied transformations if the final implementation is to conform to the initial specification. We h...
متن کاملCombining Theorem Proving and Model Checking for Certification of Behavioral Synthesis Flows
We develop a framework for certifying behavioral synthesis flows. Certification is decomposed into verified and verifying components, which are discharged by theorem proving and model checking respectively. The bridge between these components is provided by a new formal structure, clocked control data flow graph (CCDFG), that serves as the golden circuit model used in this framework. We discuss...
متن کامل